Test Series - Data Structure

3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

Test Number 117/115

Q: Binary Decision Diagram is a type of __________
A. Multigraph
B. Cyclic Graph
C. Directed Acyclic Graph
D. Directed Acyclic Word Graph
Solution: An Inverter is a directed graph which is used to solve Boolean expressions, hence have no loops.
Q: In which of the following case does a Binary Decision Diagram is used for?
A. Representation of Boolean Functions
B. String Matching
C. Searching
D. Sorting of number
Solution: A Binary Decision Diagram is used to represent a Boolean function.
Q: In a Binary Decision Diagram, how many types of terminal exists?
A. 1
B. 2
C. 3
D. 4
Solution: In a BDD, 2 terminals namely terminal-0 and terminal-1 exists.
Q: In a Binary Decision Diagrams 0 values by a _________ line and the 1 values are represented by a _________ line.
A. dashed, bold
B. bold, dashed
C. dotted, bold
D. dotted, dashed
Solution: It is used to distinguish between the 2 values without explicitly writing.
Q: How many nodes are required to create a Binary Decision Tree having 4 variables?
A. 24
B. 24-1
C. 25
D. 25-1
Solution: Binary Decision Trees are complete Binary Trees of level V + 1, here V is the number of variables.
Q: Two or more And Inverter Graphs can represent same function.
A. True
B. False
C. ....
D. ....
Solution: And Inverter Graphs are not canonical in nature.
Q: Size of an And Inverter Graph is the number of _______ gates and the number of logic levels is number of ________ gates on the __________ path from a primary input to a primary output.
A. AND, AND, average
B. AND, OR, longest
C. OR, OR, shortest
D. AND, AND, longest
Solution: The given statement forms the attributes of the And Inverter Graph.
Q: And Inverter Graph is a type of __________
A. Multigraph
B. Cyclic Graph
C. Directed Acyclic Graph
D. Directed Acyclic Word Graph
Solution: And Inverter is a directed graph which is used to solve boolean expressions, hence have no loops.
Q: The And Inverter Graph representation of a Boolean function is more efficient than the Binary Decision Diagram.
A. True
B. False
C. ....
D. ....
Solution: The conversion from the network logic is faster and more scalable than in the case of the Binary Decision Diagram.
Q: Which of the following logical operation can’t be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?
A. Conjunction
B. Disjunction
C. Negation
D. Tautology Checking
Solution: In Binary Decision Diagram, Conjunction, Disjunction, Negotiation can be implemented in polynomial time whereas tautology checking can be implemented in linear time.

You Have Score    /10